Random preorders
نویسندگان
چکیده
A random preorder on n elements consists of linearly ordered equivalence classes called blocks. We investigate the block structure of a preorder chosen uniformly at random from all preorders on n elements as n→ ∞.
منابع مشابه
Random preorders and alignments
A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a random preorder chosen uniformly at random among all preorders on n elements, and also the distribution of cycles in a random alignment chosen uniformly at random among all alignments on n elements, as n →∞.
متن کاملHitting Times, Cover Cost, and the Wiener Index of a Tree
It is well known that the vertices of any graph can be put in a linear preorder so that for random walk on the graph vertices appearing earlier in the preorder are “easier to reach but more difficult to get out of”. We exhibit further such preorders corresponding to various functions related to random walk and study their relationships. These preorders coincide when the graph is a tree, but not...
متن کاملA Logical Characterization of Efficiency Preorders
In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle o...
متن کاملOne-dimensional T-preorders
This paper studies T -preorders by using their Representation Theorem that states that every T -preorder on a set X can be generated in a natural way by a family of fuzzy subsets of X . Especial emphasis is made on the study of onedimensional T -preorders (i.e.: T -preorders that can be generated by only one fuzzy subset). Strong complete T -preorders are characterized.
متن کاملPreorders on Monads and Coalgebraic Simulations
We study the construction of preorders on Set-monads by the semantic ⊤⊤-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Card-chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their composite monad. We also relate the constructi...
متن کامل